Sherman-morrison-woodbury-formula-based algorithms for the surface smoothing problem

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sherman-Morrison-Woodbury Formula-based Algorithms for the Surface Smoothing Problem

Surface smoothing applied to range/elevation data acquired using a variety of sources has been a very active area of research in computational vision over the past decade. Generalized splines have emerged as the single most popular approximation tool to this end. In this paper we present a new and fast algorithm for solving the surface smoothing problem using a membrane, a thin-plate, or a thin...

متن کامل

A generalization of the Sherman-Morrison-Woodbury formula

In this paper, we develop conditions under which the Sherman–Morrison–Woodbury formula can be represented in the Moore–Penrose inverse and the generalized Drazin inverse forms. These results generalize the original Sherman–Morrison–Woodbury formula. © 2011 Elsevier Ltd. All rights reserved.

متن کامل

Remarks on the Sherman-morrison-woodbury Formulae

We present some results on generalized inverses and their application to generalizations of the Sherman-Morrison-Woodbury-type formulae.

متن کامل

A New Algorithm for General Cyclic Heptadiagonal Linear Systems Using Sherman-Morrison-Woodbury formula

In this paper, a new efficient computational algorithm is presented for solving cyclic heptadiagonal linear systems based on using of heptadiagonal linear solver and Sherman–Morrison–Woodbury formula. The implementation of the algorithm using computer algebra systems (CAS) such as MAPLE and MATLAB is straightforward. Numerical example is presented for the sake of illustration.

متن کامل

Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman-Morrison Formula

Let Ax = b be a large, sparse, nonsymmetric system of linear equations. A new sparse approximate inverse preconditioning technique for such a class of systems is proposed. We show how the matrix A−1 0 −A−1, where A0 is a nonsingular matrix whose inverse is known or easy to compute, can be factorized in the form UΩV T using the Sherman–Morrison formula. When this factorization process is done in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1997

ISSN: 0024-3795

DOI: 10.1016/s0024-3795(97)80366-7